G_BEGIN_DECLS
/*
- * SECTION:gtkcountingbloomfilter
- * @Short_description: A counting bloom filter
- * @Title: GtkCountingBloomFilter
- * @See_also: https://en.wikipedia.org/wiki/Bloom_filter,
- * https://en.wikipedia.org/wiki/Counting_Bloom_filter
+ * GtkCountingBloomFilter:
*
* This implements a counting bloom filter. A bloom filter is a space-efficient
* probabilistic data structure that is used to test whether an element may be
* are 16bit hash values.
* It is possible to use 32bit hash values or a different number of bits, should this
* be considered useful.
+ *
+ * See: [Bloom filter](https://en.wikipedia.org/wiki/Bloom_filter),
+ * [Counting Bloom filter](https://en.wikipedia.org/wiki/Counting_Bloom_filter)
*/
/* The number of bits from the hash we care about */